LOCC indistinguishable orthogonal product quantum states

نویسندگان

  • Xiaoqian Zhang
  • Xiaoqing Tan
  • Jian Weng
  • Yongjun Li
چکیده

We construct two families of orthogonal product quantum states that cannot be exactly distinguished by local operation and classical communication (LOCC) in the quantum system of (2k+i) ⊗ (2l+j) (i, j ∈ {0, 1} and i ≥ j ) and (3k+i) ⊗ (3l+j) (i, j ∈ {0, 1, 2}). And we also give the tiling structure of these two families of quantum product states where the quantum states are unextendible in the first family but are extendible in the second family. Our construction in the quantum system of (3k+i) ⊗ (3l+j) is more generalized than the other construction such as Wang et al.'s construction and Zhang et al.'s construction, because it contains the quantum system of not only (2k) ⊗ (2l) and (2k+1) ⊗ (2l) but also (2k) ⊗ (2l+1) and (2k+1) ⊗ (2l+1). We calculate the non-commutativity to quantify the quantumness of a quantum ensemble for judging the local indistinguishability. We give a general method to judge the indistinguishability of orthogonal product states for our two constructions in this paper. We also extend the dimension of the quantum system of (2k) ⊗ (2l) in Wang et al.'s paper. Our work is a necessary complement to understand the phenomenon of quantum nonlocality without entanglement.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orthogonality And Distinguishability: Criterion For Local Distinguishability of Arbitrary Orthogonal States

We consider deeply the relation between the orthogonality and the distinguishability of a set of arbitrary states (including multi-partite states). It is shown that if a set of arbitrary states can be distinguished by local operations and classical communication (LOCC), each of the states can be written as a linear combination of product vectors such that all product vectors of one of the state...

متن کامل

Small sets of locally indistinguishable orthogonal maximally entangled states

We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of k ≤ d orthogonal maximally entangled states in Cd ⊗ Cd that are not perfectly distinguishable by LOCC. A recent result by Yu, Duan, and Ying [Phys. Rev. Lett. 109 020506 (2012)] gives an affirmative answer for the case...

متن کامل

ua nt - p h / 02 08 05 9 v 1 9 A ug 2 00 2 Criterion for local distinguishability of arbitrary bipartite orthogonal states Ping -

In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical comunication. We also present a necessary condition of distinguishability of bipartite quantum states which is simple and general. With this condition one can get m...

متن کامل

ua nt - p h / 02 08 05 9 v 2 1 2 A ug 2 00 2 Criterion for local distinguishability of arbitrary bipartite orthogonal states

In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical comunication. We also present a necessary condition of distinguishability of bipartite quantum states which is simple and general. With this condition one can get m...

متن کامل

The distillable entanglement of multiple copies of Bell states

It is impossible to discriminate four Bell states through local operations and classical communication (LOCC), if only one copy is provided. To complete this task, two copies will suffice and be necessary. When n copies are provided, we show that the distillable entanglement is exactly n − 2. 03.67.Hk,03.65.Ud Typeset using REVTEX 1 The no-cloning theorem [1] asserts that it is impossible to di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2016